def solve():
n = int(input())
if n == 3:
out = "NO"
else:
out = "YES\n"
a, b = 1, -1
if n%2 != 0:
a = int((n-1)/2-1)
b = int((1-n)/2)
for i in range(0, n):
if i%2 == 0:
out += str(a)
else:
out += str(b)
out += ' '
print(out)
t = int(input())
for i in range(0, t):
solve()#include <bits/stdc++.h>
using namespace std;
void solve(){
int n;
cin >> n;
if (n == 2){
cout << "YES" << '\n';
cout << -1 << ' ' << 1 << '\n';
return;
}
if (n == 3) {
cout << "NO" << '\n';
return;
}
cout << "YES" << '\n';
int ans[2];
ans[0] = (2 - n) / 2;
ans[1] = - ans[0] + (n & 1);
for (int i = 0; i < n; ++i)
cout << ans[i & 1] << ' ';
cout << '\n';
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while(t--){
solve();
}
return 0;
}468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |